Fully Distributed Second-Order Cone Programming Model for Expansion in Transmission and Distribution Networks

نویسندگان

چکیده

As the penetration level of distributed energy resources (DERs) is increasing at distribution level, stakeholders are no longer pure consumers and they play a more active role. DERs can be used for transmission needs, technical impacts them may propagate to level. To unlock full benefits transmission-distribution coordination, this article proposes second-order cone programming (SOCP) based expansion model coordinated networks by decomposition parallelization. First, we formulate an SOCP-based subnetwork problem related voltage phase angle variables which valid both networks. Then, fully decision-making framework presented solve iteratively. Taking total power output each as interacting variable, deploy operation optimization substations master subnetworks subproblems in modified iteration algorithm. The feasibility optimality proved numerically verified. Simulation results indicate advantages prevent line congestion, decrease boundary mismatches accommodate DERs.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Waveform Design using Second Order Cone Programming in Radar Systems

Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...

متن کامل

Second-order cone programming

Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Linear programs, convex quadratic programs and quadratically constrained convex quadratic programs can all be formulated as SOCP problems, as can many other problems t...

متن کامل

Stochastic Second-Order Cone Programming in Mobile Ad Hoc Networks

We propose a two-stage stochastic second-order cone programming formulation of the semidefinite stochastic location-aided routing (SLAR) model, described in Ariyawansa and Zhu (Q. J. Oper. Res. 4(3), 239–253, 2006). The aim is to provide a sender node S with an algorithm for optimally determining a region that is expected to contain a destination node D (the expected zone). The movements of the...

متن کامل

Distributed RSS-Based Localization in Wireless Sensor Networks Based on Second-Order Cone Programming

In this paper, we propose a new approach based on convex optimization to address the received signal strength (RSS)-based cooperative localization problem in wireless sensor networks (WSNs). By using iterative procedures and measurements between two adjacent nodes in the network exclusively, each target node determines its own position locally. The localization problem is formulated using the m...

متن کامل

Semidefinite and Second Order Cone Programming

1 Overview We survey the basic notions of cones and cone-LP and give several examples mostly related to semidefinite programming. The linear and semidefinite programming problems are formulated as follows: Let c ∈ n and b ∈ m ,A ∈ n×m with rows a i ∈

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Systems Journal

سال: 2022

ISSN: ['1932-8184', '1937-9234', '2373-7816']

DOI: https://doi.org/10.1109/jsyst.2022.3154811